Resource Sharing Interconnection Networks in Multiprocessors

نویسندگان

  • Benjamin W. Wah
  • Jie-Yong Juang
چکیده

In this paper, circuit-switched interconnection networks for resource sharing in multiprocessors, named resource sharing interconnection networks, are studied. Resource scheduling in systems with such an interconnection network entails the efficient search of a mapping from requesting processors to free resources such that circuit blockages in the network are minimized and resources are maximally used. The optimal mapping is obtained by transforming the scheduling problems into various network flow problems for which existing algorithms can be applied. A distributed architecture to realize a maximum flow algorithm using token propagations is also described. The proposed method is applicable to any general loop-free network configuration in which the requesting processors and free resources can be partitioned into two disjoint subsets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Interconnection Designs for Switch-based Local Area Networks 1

Today, with the proliferation of switch-based local area network standards, such as ATM (Asynchronous Transfer Mode), HIPPI (HIgh Performance Parallel Interface) and Fibre Channel, the issue of the eecient interconnection among connection-oriented switches arises. This paper presents a study of eecient arrangements of switches intended to support a local area network environment. This multi-swi...

متن کامل

A Resource Exchange Architecture for Peer-to-Peer File Sharing Applications

A peer-to-peer (P2P) file sharing network provides a resource sharing platform for Internet users. To increase higher-degree resource sharing, heterogeneous P2P file sharing networks need a way to collaborate and communicate with each other. Based on the approach of interconnecting heterogeneous P2P file sharing networks, users on one P2P file sharing network can share resources and search data...

متن کامل

Analysis of Interconnection Networks for Cache Coherent Multiprocessors with Scientific Applications

Interconnection networks, such as, shared bus and multistage interconnection networks (MINs) are very suitable for the design of shared memory multiprocessors. The existing analytical models of these networks are based on unrealistic synthetic workload for simplicity of the analyses. Also, they consider the networks in isolation without incorporating other architectural details of a multiproces...

متن کامل

Design and analysis of static memory management policies for CC-NUMA multiprocessors

In this paper, we characterize the performance of three existing memory management techniques, namely, buddy, round-robin, and first-touch policies. With existing memory management schemes, we find several cases where requests from different processors arrive at the same memory simultaneously. To alleviate this problem, we present two improved memory management policies called skew-mapping and ...

متن کامل

Execution Based Evaluation of Multistage Interconnection Networks for Cache-Coherent Multiprocessors

In this paper, performance of multistage interconnection network with wormhole routing and packet switching has been evaluated for cache-coherent shared-memory multiprocessors. The traac in cache-coherent systems is characterized by traac bursts, one-to-many and many-to-one traac, and small xed length messages. The evaluation is based on execution-driven simulation using various applications. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1986